Probabilistic Checking of Proofs and Hardness of Approximation Problems
نویسندگان
چکیده
Princeton tech reports are available in postscript form via anonymous ftp from ftp cs princeton edu InterNet address You may log in as anonymous and give your email ad dress as password Change to the directory reports The le README gives details and the le INDEX lists the numbers and the titles of all reports This report is numbered Hard copies of this report are available for a charge of only US dollar checks accepted from the following address
منابع مشابه
Probabilistic Checking of Proofs and Hardness of Approximation
This paper introduces basic notions of classic computational complexity theory and probabilistically checkable proof. It sketches the proof of the PCP theorem, and discusses its applications to the hardness of approximation of various problems.
متن کاملQuery-Efficient Checking of Proofs and Improved PCP Characterizations of NP
The advent of Probabilistically Checkable Proofs (PCP) established the surprising result that the validity of a proof can be checked with good accuracy by reading only a very small number of randomly selected locations of the proof. In particular, if one is willing to tolerate a small probability of error, then one need not even read the entire proof in order to check its validity! The celebrat...
متن کاملFree Bits and Non - Approximability ( Extended
This paper investigates the possibility that tight hardness of approximation results may be derived for several combinatorial optimization problems via the “pcp-connection” (a.k.a., the FGLSS-reduction [FGLSS]). We study the amortized free bit-complexity of probabilistic verifiers and “invert the FGLSS-reduction” by showing that an NP-hardness result for the approximation of MaxClique to within...
متن کاملFree Bits, Pcps and Non-approximability| towards Tight Results in Honor of Shimon Even's 60 Th Birthday
This paper continues the investigation of the connection between proof systems and approximation. The emphasis is on proving tight non-approximability results via consideration of measures like the \free bit complexity" and the \amortized free bit complexity" of proof systems. The rst part of the paper presents a collection of new proof systems based on a new errorcorrecting code called the lon...
متن کاملFree Bits, PCPs and Non-Approximability - Towards Tight Results
This paper continues the investigation of the connection between proof systems and approximation. The emphasis is on proving tight non-approximability results via consideration of measures like the \free bit complexity" and the \amortized free bit complexity" of proof systems. The rst part of the paper presents a collection of new proof systems based on a new errorcorrecting code called the lon...
متن کامل